A centerline symmetry and double-line transformation based algorithm for large-scale multi-objective optimization

نویسندگان

چکیده

The search space of large-scale multi-objective optimization problems (LSMOPs) is huge because the hundreds or even thousands decision variables involved. It very challenging to design efficient algorithms for LSMOPs whole effectively and balance convergence diversity at same time. In this paper, tackle challenge, we develop a new algorithm based on weighted framework with two effective strategies. transforms an LSMOP into multiple small-scale problem transformation mechanism reduce dimensionality effectively. To further improve its effectiveness, firstly propose centerline symmetry strategy select reference solutions transform LSMOPs. takes not only some non-dominated but also their symmetric points as solutions, which can enhance population avoid falling local minima. Then, double-line function designed expand range transformed diversity. With strategies, more widely distributed potential areas are provided optimal be found easier. demonstrate effectiveness our proposed algorithm, numerical experiments used benchmarks executed statistical results show that competitive performs better than other state-of-the-art solving

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

MOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm

In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...

متن کامل

Optimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm

Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...

متن کامل

Multi-objective Grasshopper Optimization Algorithm based Reconfiguration of Distribution Networks

Network reconfiguration is a nonlinear optimization procedure which calculates a radial structure to optimize the power losses and improve the network reliability index while meeting practical constraints. In this paper, a multi-objective framework is proposed for optimal network reconfiguration with the objective functions of minimization of power losses and improvement of reliability index. T...

متن کامل

A HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION

In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Connection science

سال: 2022

ISSN: ['0954-0091', '1360-0494']

DOI: https://doi.org/10.1080/09540091.2022.2075828